On covering of products of T-generalized state machines
نویسندگان
چکیده
We introduce the concepts of T-generalized state machines and coverings of products of them. Also some of algebraic properties of them are investigated. Finely some products such as direct sum and sum of Tgeneralized state machines are introduced. An interesting distributive property of cascade product over the sum of Tgeneralized state machines concern to covering of T-generalized state machines is stablished.
منابع مشابه
Restricted cascade and wreath products of fuzzy finite switchboard state machines
A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...
متن کاملMistake Proofing Cam Mechanism Through Six-sigma Process: Case Study on Clothes Printing Machines
Controlling the occurrence of defects is a major challenge for manufacturing organizations that are seeking to enhance their competitive position in today’s global market. This paper considers the process of screen-printing T-shirts using hydraulic and pneumatic printing machines. Several defects in the output of this printing process have been observed, especially with multi colors printing as...
متن کاملSOME PROPERTIES OF T-FUZZY GENERALIZED SUBGROUPS
In this paper, we deal with Molaei’s generalized groups. We definethe notion of a fuzzy generalized subgroup with respect to a t-norm (orT-fuzzy generalized subgroup) and give some related properties. Especially,we state and prove the Representation Theorem for these fuzzy generalizedsubgroups. Next, using the concept of continuity of t-norms we obtain a correspondencebetween TF(G), the set of ...
متن کاملHeuristic and exact algorithms for Generalized Bin Covering Problem
In this paper, we study the Generalized Bin Covering problem. For this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. To nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. By computational experiments, the eciency of the heuristic algorithm is assessed.
متن کاملOn subgroups of topologized fundamental groups and generalized coverings
In this paper, we are interested in studying subgroups of topologized fundamental groups and their influences on generalized covering maps. More precisely, we find some relationships between generalized covering subgroups and the other famous subgroups of the fundamental group equipped with the compact-open topology and the whisker topology. Moreover, we present some conditions unde...
متن کامل